Arithmetical meadows
نویسندگان
چکیده
An inversive meadow is a commutative ring with identity equipped with a total multiplicative inverse operation satisfying 0 −1 = 0. Previously, inversive meadows were shortly called meadows. A divisive meadow is an inversive meadows with the multiplicative inverse operation replaced by a division operation. In the spirit of Peacock's arithmetical algebra, we introduce variants of inversive and divisive meadows without an additive identity element and an additive inverse operation. We give equational axiomatizations of several classes of such variants of inversive and divisive meadows as well as of several instances of them.
منابع مشابه
Arithmetical Knowledge and Arithmetical Definability: Four Studies
by Sean Walsh The subject of this dissertation is arithmetical knowledge and arithmetical definability. The first two chapters contain respectively a critique of a logicist account of a preferred means by which we may legitimately infer to arithmetical truths and a tentative defense of an empiricist account. According to the logicist account, one may infer from quasi-logical truths to patently ...
متن کاملOn the Connecting Thickness of Arithmetical Discrete Planes
While connected rational arithmetical discrete lines and connected rational arithmetical discrete planes are entirely characterized, only partial results exist for the irrational arithmetical discrete planes. In the present paper, we focus on the connectedness of irrational arithmetical discrete planes, namely the arithmetical discrete planes with a normal vector of which the coordinates are no...
متن کاملArithmetical Rank of Toric Ideals Associated to Graphs
Let IG ⊂ K[x1, . . . , xm] be the toric ideal associated to a finite graph G. In this paper we study the binomial arithmetical rank and the Ghomogeneous arithmetical rank of IG in 2 cases: (1) G is bipartite, (2) IG is generated by quadratic binomials. In both cases we prove that the binomial arithmetical rank and the G-arithmetical rank coincide with the minimal number of generators of IG.
متن کاملA Quantum Gate as a Physical Model of an Universal Arithmetical Algorithm without Church’s Undecidability and Gödel’s Incompleteness
In this work we define an universal arithmetical algorithm, by means of the standard quantum mechanical formalism, called universal qm-arithmetical algorithm. By universal qm-arithmetical algorithm any decidable arithmetical formula (operation) can be decided (realized, calculated. Arithmetic defined by universal qm-arithmetical algorithm called qmarithmetic one-to-one corresponds to decidable ...
متن کاملInversive meadows and divisive meadows
An inversive meadow is a commutative ring with identity and a total multiplicative inverse operation satisfying 0 = 0. Previously, inversive meadows were shortly called meadows. In this paper, we introduce divisive meadows, which are inversive meadows with the multiplicative inverse operation replaced by a division operation. We introduce a translation from the terms over the signature of divis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0909.2088 شماره
صفحات -
تاریخ انتشار 2009